JavaScript Source Code 2002: Games: Hanoi Solver

Home

Hanoi Solver

Solves the Towers of Hanoi game in the shortest number of moves, demo included. The delay between moves and the number of rings can be adjusted by the user. Clever!

JavaScript Source Code 2002: Games: Hanoi Solver
Simply click inside the window below, use your cursor to highlight the script, and copy (type Control-c or Apple-c) the script into a new file in your text editor (such as Note Pad or Simple Text) and save (Control-s or Apple-s). The script is yours!!!

  <HEAD> <SCRIPT LANGUAGE="JavaScript">  <! > <! >  </script> </HEAD>  <BODY> <center> <form name=formHanoi> <textarea name=display rows=10 cols=56></textarea><br> <table border=0 cellspacing=10 cellpadding=0> <tr> <td>Number of disks</td> <td><select name=disk> <option selected value=random>Random <option value=1>1 <option value=2>2 <option value=3>3 <option value=4>4 <option value=5>5 <option value=6>6 <option value=7>7 <option value=8>8 </select></td> </tr> <tr> <td>Movement delay</td> <td><select name=delay> <option value=100>100 milliseconds <option value=200>200 milliseconds <option value=300>300 milliseconds <option value=400>400 milliseconds <option selected value=500>500 milliseconds <option value=600>600 milliseconds <option value=700>700 milliseconds <option value=800>800 milliseconds <option value=900>900 milliseconds <option value=1000>1000 milliseconds </select></td> </tr> </table> <input type=button value="Start" onClick="init();"> <input type=button value="Stop" onClick="stop();"> </form> </center>

Number of disks
Movement delay